Complete tripartite subgraphs in the coprime graph of integers
نویسنده
چکیده
We denote by f(n, k) the number of positive integers m no,AC{1,2,...,n} with lAl>f(n,2) (if61n then f(n,2)= in), then the coprime graph induced by A contains a complete tripartite graph on 2 Lc,,,~~~;,,, J + 1 vertices where one of the classes is a single vertex and the other two classes each have Lc&$&--J vertices. @ 1999 Elsevier Science B.V. All rights reserved
منابع مشابه
On a sequence related to the coprime integers
The asymptotic behaviour of the sequence with general term $P_n=(varphi(1)+varphi(2)+cdots+varphi(n))/(1+2+cdots+n)$, is studied which appears in the studying of coprime integers, and an explicit bound for the difference $P_n-6/pi^2$ is found.
متن کاملOn Generalized Coprime Graphs
Paul Erdos defined the concept of coprime graph and studied about cycles in coprime graphs. In this paper this concept is generalized and a new graph called Generalized coprime graph is introduced. Having observed certain basic properties of the new graph it is proved that the chromatic number and the clique number of some generalized coprime graphs are equal.
متن کاملCoprime and Prime Labelings of Graphs
A coprime labeling of a simple graph of order n is a labeling in which adjacent vertices are given relatively prime labels, and a graph is prime if the labels used can be taken to be the first n positive integers. In this paper, we consider when ladder graphs are prime and when the corresponding labeling may be done in a cyclic manner around the vertices of the ladder. Furthermore, we discuss c...
متن کاملComplete Tripartite Graphs and their Competition Numbers
We present a piecewise formula for the competition numbers of the complete tripartite graphs. For positive integers x, y and z where 2 ≤ x ≤ y ≤ z, the competition number of the complete tripartite graph Kx,y,z is yz − z − y − x + 3 whenever x 6= y and yz − 2y − z + 4 otherwise.
متن کاملRemainder Cordial Labeling of Graphs
In this paper we introduce remainder cordial labeling of graphs. Let $G$ be a $(p,q)$ graph. Let $f:V(G)rightarrow {1,2,...,p}$ be a $1-1$ map. For each edge $uv$ assign the label $r$ where $r$ is the remainder when $f(u)$ is divided by $f(v)$ or $f(v)$ is divided by $f(u)$ according as $f(u)geq f(v)$ or $f(v)geq f(u)$. The function$f$ is called a remainder cordial labeling of $G$ if $left| e_{...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 202 شماره
صفحات -
تاریخ انتشار 1999